Hamilton–Jacobi–Bellman Equation under States Constraints

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying mental states from neural states under mental constraints.

This article emphasizes how the recently proposed interlevel relation of contextual emergence for scientific descriptions combines 'bottom-up' and 'top-down' kinds of influence. As emergent behaviour arises from features pertaining to lower level descriptions, there is a clear bottom-up component. But, in general, this is not sufficient to formulate interlevel relations stringently. Higher leve...

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

Inheritance under Participation Constraints

Traditional database systems have been successful in handling large amounts of data but lack mechanisms for schema derivations and schema veriication. In this paper, we propose (i) structures that carry expressive and useful information on the database schema, (ii) a set of inference rules for schema derivations, and (iii) a mechanism for discovering contradictory schema declarations. To this e...

متن کامل

Generation under Space Constraints

Reasoning about how much to generate when space is limited is a challenge for generation systems. This paper presents two algorithms that exploit the discourse structure to decide which content to drop when there are space restrictions, in the context of producing documents from pre-authored text fragments. We analyse the effectiveness of both algorithms and show that the second is near optimal.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2000

ISSN: 0022-247X

DOI: 10.1006/jmaa.1999.6684